A Simple Learning Rule for Resilient Nash Equilibria

نویسندگان

  • Siddharth Pal
  • Richard J. La
چکیده

We consider scenarios where distributed agents are imperfect and occasionally adopt incorrect actions by mistake. Our goal is to design a distributed learning rule that allows the agents to seek resilient pure-strategy Nash equilibria (PSNEs) that can tolerate deviations potentially by multiple agents. We propose a new learning rule with a tunable parameter for pursuing resilient PSNEs, called Simple Experimentation with Monitoring (SEM). We prove that, when all agents adopt the SEM rule, the only stochastically stable states are PSNEs with a certain tunable level of resilience.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning to Play Nash in Deterministic Uncoupled Dynamics

This paper is concerned with the following problem. In a bounded rational game where players cannot be as super-rational as in Kalai and Leher (1993), are there simple adaptive heuristics or rules that can be used in order to secure convergence to Nash equilibria, or convergence only to a larger set designated by correlated equilibria? Are there games with uncoupled deterministic dynamics in di...

متن کامل

A new consequence of Simpson’s paradox: Stable co-operation in one-shot Prisoner’s Dilemma from populations of individualistic learning agents

Normative theories of individual choice in economics typically assume that interacting agents should each act individualistically: i.e., they should maximize their own utility function. Specifically, game theory proposes that interaction should be governed by Nash equilibria. Computationally limited agents (whether artificial, animal or human) may not, however, have the capacity to carry out th...

متن کامل

Choice under social influence : effects of learning behaviors on the collective dynamics

We consider a simple model in which a population of individuals with idiosyncratic willingnesses to pay must choose repeatedly either to buy or not a unit of a single homogeneous good at a given price. Utilities of buyers have positive externalities due to social interactions among customers. If the latter are strong enough, the system has multiple Nash equilibria, revealing coordination proble...

متن کامل

Simple reinforcement learning agents: Pareto beats Nash in an algorithmic game theory study

Repeated play in games by simple adaptive agents is investigated. The agents use Q-learning, a special form of reinforcement learning, to direct learning of behavioral strategies in a number of 2! 2 games. The agents are able effectively to maximize the total wealth extracted. This often leads to Pareto optimal outcomes. When the rewards signals are sufficiently clear, Pareto optimal outcomes w...

متن کامل

On Learning Algorithms for Nash Equilibria

Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising games, and thus results on the convergence or nonconvergence properties of such dynamics may inform our understanding of the applicability of Nash equilibria as a plausible solution concept in some settings. A second reas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015